A Flexible Example-Based Parser Based on the SSTC

نویسندگان

  • Mosleh Hmoud Al-Adhaileh
  • Enya Kong Tang
چکیده

In this paper we sketch an approach for Natural Language parsing. Our approach is an example-based approach, which relies mainly on examples that already parsed to their representation structure, and on the knowledge that we can get from these examples the required information to parse a new input s e n t e n c e . In our approach, examples are annotated with the Structured String Tree Correspondence (SSTC) annotation schema where each SSTC describes a sentence, a representation tree as well as the correspondence between substrhzgs in the sentence and subtrees in the representation tree. In the process of parsing, we first try to build subtrees for phrases in the input sentence which have been successfully found in the example-base a bottom up approach. These subtrees will then be combined together to form a single rooted representation tree based on an example with similar representation structure a top down approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Flexible Example-based Parser Based on the Sstc"

In this paper we sketch an approach for Natural Language parsing. Our approach is an example-based approach, which relies mainly on examples that already parsed to their representation structure, and on the knowledge that we can get from these examples the required information to parse a new input s e n t e n c e . In our approach, examples are annotated with the Structured String Tree Correspo...

متن کامل

Example-Based Machine Translation Based on the Synchronous SSTC Annotation Schema

In this paper, we describe an Example-Based Machine Translation (EBMT) system for EnglishMalay translation. Our approach is an examplebased approach which relies sorely on example translations kept in a Bilingual Knowledge Bank (BKB). In our approach, a flexible annotation schema called Structured String-Tree Correspondence (SSTC) is used to annotate both the source and target sentences of a tr...

متن کامل

Feature Engineering in Persian Dependency Parser

Dependency parser is one of the most important fundamental tools in the natural language processing, which extracts structure of sentences and determines the relations between words based on the dependency grammar. The dependency parser is proper for free order languages, such as Persian. In this paper, data-driven dependency parser has been developed with the help of phrase-structure parser fo...

متن کامل

Symbiosis between a Multilingual Lexicon and Translation Example Banks

We propose a symbiotic framework in which correspondences between electronic multilingual lexicons and translation example banks can be captured, so that their functions and contents may benefit and improve upon one another. Several mechanisms are used for this purpose: i.) two flexible annotation schemas, S-SSTC and SSTC+L, for supporting irregular multi-level correspondences across languages;...

متن کامل

Synchronous Structured String-Tree Correspondence (S-SSTC)

In this paper, a flexible annotation schema called Structured String-Tree Correspondence (SSTC) is introduced. We propose a variant of SSTC called synchronous SSTC. Synchronous SSTC can be used to describe the correspondence between different languages. We will also describe how synchronous SSTC provides the flexibility to treat some of the non-standard cases, which are problematic to other syn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998